Linear motion planning with controlled collisions and pure planar braids

نویسندگان

چکیده

We compute the Lusternik-Schnirelmann category (LS-cat) and higher topological complexity ($TC_s$, $s\geq2$) of "no-$k$-equal" configuration space Conf$_k(\mathbb{R},n)$. This yields (with $k=3$) LS-cat Khovanov's group PP$_n$ pure planar braids on $n$ strands, which is an $\mathbb{R}$-analogue Artin's classical braid strands. Our methods can be used to describe optimal motion planners for provided small.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Affine Configurations and Pure Braids

We show that the fundamental group of the space of ordered affine-equivalent configurations of at least five points in the plane is isomorphic to the pure braid group modulo its centre and provide a presentation.We also show the existence of trivial 4-braids whose strands must align at some instant in the isotopy that trivializes them.

متن کامل

Pure Virtual Braids, Resonance, and Formality

We investigate the resonance varieties, lower central series ranks, and Chen ranks of the pure virtual braid groups and their upper-triangular subgroups. As an application, we give a complete answer to the 1-formality question for this class of groups. In the process, we explore various connections between the Alexander-type invariants of a finitely generated group and several of the graded Lie...

متن کامل

chaotic motion and its control for a non-planar non-linear cantilever beam with parametric excitation

in this paper, chaotic motion analysis and its control for a non-planar non-linear cantilever beam with axial and lateral parametric excitation in the free end is accomplished. this is a new method for control of chaotic motion of a non-linear planar beam. in this survey, internal resonance of the beam is 2:1 and the initial resonance is in the outside of plane and it is assumed a sub-resonance...

متن کامل

Decentralized Multi-Agent Navigation Planning with Braids

We present a novel planning framework for navigation in dynamic, multi-agent environments with no explicit communication among agents, such as pedestrian scenes. Inspired by the collaborative nature of human navigation, our approach treats the problem as a coordination game, in which players coordinate to avoid each other as they move towards their destinations. We explicitly encode the concept...

متن کامل

Motion planning for planar n-bar mechanisms with revolute joints

Maximizing the use of dual-arm robotic systems requires the development of planning algorithms analogous to those available for single-arm operations. In this paper, the global properties of the configuration spaces of planar n-bar mechanisms (i.e., kinematic chains forming a single closed loop) are used to design a complete motion planning algorithm. Numerical experiments demonstrate the algor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Homology, Homotopy and Applications

سال: 2021

ISSN: ['1532-0073', '1532-0081']

DOI: https://doi.org/10.4310/hha.2021.v23.n1.a15